Welcome![Sign In][Sign Up]
Location:
Search - A star algorithm

Search list

[Applicationsa20040623neta

Description: A star 算法求解最短路径问题-A star algorithm for the shortest path problem
Platform: | Size: 8192 | Author: 刘学英 | Hits:

[AlgorithmA star算法类的C++语言实现

Description: A star算法类的C++语言实现-algorithm category C Language
Platform: | Size: 3072 | Author: 杨武夷 | Hits:

[AI-NN-PRA star算法类的实现(接口设计)

Description: A star 算法类的实现(算法接口,针对迷宫问题设计)-algorithm to achieve the category (algorithm interface design issues against maze)
Platform: | Size: 3072 | Author: 刘世炎 | Hits:

[AI-NN-PRA star算法的实现

Description: 昨天刚刚看到的A star算法类的实现,不知道对大家有没有用,参考一下吧-Yesterday, I saw a star of the algorithm to achieve category, we do not know of any use it for reference
Platform: | Size: 3072 | Author: 吕冰 | Hits:

[Data structsa-star-algorithm-implementation

Description: 基于stl的a star寻路算法的高效实现-Stl of a star-based routing algorithm to achieve efficient
Platform: | Size: 18432 | Author: WestWeald | Hits:

[VC/MFCAstar

Description: A*(A-Star)算法是一种静态路网中求解最短路最有效的方法。 公式表示为: f(n)=g(n)+h(n), 其中f(n) 是节点n从初始点到目标点的估价函数, g(n) 是在状态空间中从初始节点到n节点的实际代价, h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.
Platform: | Size: 13312 | Author: 朱宝三 | Hits:

[source in ebookAStar

Description: A STAR 算法源码, 比较初级的算法, 适合初学的朋友研究-A STAR algorithm source code, compare the initial algorithm, suitable for beginner
Platform: | Size: 186368 | Author: wzh | Hits:

[AI-NN-PRastar

Description: 用prolog实现的一个A星算法,由于最近在看prolog,所以,陆续会放上来一些prolog的代码,希望对大家有用。 -Prolog realize with a A Star algorithm, look at the recent prolog, therefore, one after another will放上来some prolog code, in the hope that useful to everyone.
Platform: | Size: 1024 | Author: li | Hits:

[AI-NN-PRA-star(vb)

Description: 初学A*算法的很好源码,基于最短路径规则-Novice A* algorithm is a good source, based on the shortest path rules
Platform: | Size: 5120 | Author: 杨羽 | Hits:

[AI-NN-PRSPath

Description: 原创,A-star算法求解最短路径,寻路问题。 求解效率高,且对于理解A-Star算法和数据结构链表操作有非常有用。-Original, A-star algorithm for solving the shortest path routing problem. Solving high efficiency, and for understanding the A-Star algorithm and data structure linked list has a very useful operation.
Platform: | Size: 2048 | Author: lys | Hits:

[Button controlAStar

Description: 以A-star算法为基础的通过改良的最短路径探索的源代码-To A-star algorithm based on the shortest path through the modified source code to explore
Platform: | Size: 3096576 | Author: 刘叶 | Hits:

[AI-NN-PRAStar

Description: 模式识别中的寻路算法:A星算法的实现及简单应用-Pattern Recognition routing algorithm: A Star algorithm and a simple application
Platform: | Size: 5626880 | Author: 丁丁 | Hits:

[GDI-Bitmapa

Description: A星算法在游戏中人物的移动中,寻找路径起到了很大的作用,使游戏人物按最近的路线到达目的地-A star algorithm in the mobile game figures to find the path has played a significant role in bringing the game characters in accordance with the recent arrival routes
Platform: | Size: 7452672 | Author: 110 | Hits:

[AI-NN-PRAstar_TSP

Description: 用A星算法解决旅行商(货郎担)问题,附设计报告和测试用例-A Star algorithm used to solve TSP (traveling salesman) problems, with the design of reports and test cases
Platform: | Size: 60416 | Author: 杨猛 | Hits:

[ConsoleAstarfindpath

Description: 用A star算法来解决寻路问题,程序简单易实现。给定几种不同的地图进行验证,得到较优的路径-A star algorithm used to solve the routing problem, the procedure is simple and easy to achieve. Given several different maps to verify the path to be better
Platform: | Size: 67584 | Author: huangdingcai | Hits:

[JSP/JavaAStarUpan

Description: 用A星算法求解八数码问题,使用的是JAVA语言编程,开发环境是Netbeans-With A Star Algorithm 8 digital issues, using the JAVA programming language, development environment is Netbeans
Platform: | Size: 3046400 | Author: 袁晓 | Hits:

[JSP/Java8_puzzle

Description: 8数码问题的Java求解,采用A*算法。数据结构采用的Vector<int[]>。输出为"no solution"或一系列表示求解过程的字符串。 某些30步的测试样例需要半分钟左右,但是绝对是正确解~~万望您能不吝点滴时间耐心等待……orz thnx~~ 我用的启发函数计算了现在的网格距离目标网格还有多远。 具体算法是,将每一格中的数字的坐标与其应该在的坐标的差加到一起,得到这个最终值h(x) 也就是Manhattan_Distance 源码使用方法:建立Java Project后,分别建立三个同名的.java文件,将源码分别复制过去然后编译运行即可。-a source code that solves the 8 puzzle problem. it uses A-star algorithm, and a major data structure of Vector<int[]>. The output of the program would be "no solution" or a series of strings representing the moves during the solution. Well, some samples need to be proceeded for around 30 seconds, but the program per se is indeed correct and will ultimately generate the shortest solution. so if u encounter such occasion plz jst wait for a while tho~~~ thnx~!! the heuristic function, say h(x), in this source code is the sum of the Mahattan Distance of each block from its destination block. How to use: build a Java Project, and create three .java files with the same names in the .zip file accordingly, and copy the source from the .zip file and just compile and run~~! have fun thnx~!
Platform: | Size: 669696 | Author: Siegfried | Hits:

[Data structsa-star-algorithm-implementation

Description: A* 算法可复用的实现(用了模板), 并配有几个简单例子-the implementation of A star algorithm with C++ template. some simple but classic problems solved with it is here too.
Platform: | Size: 18432 | Author: lichunyu | Hits:

[matlabA-star-base-programs

Description: A star algorithm to find the shortest path between two nodes
Platform: | Size: 5120 | Author: shriram | Hits:

[matlabA star

Description: 使用A star算法进行路径规划。。matlab代码。。。。。。(Path planning using the A star algorithm)
Platform: | Size: 180224 | Author: shaoyy | Hits:
« 12 3 4 5 6 7 8 9 10 ... 17 »

CodeBus www.codebus.net